Sparse and Greedy: Sparsifying Submodular Facility Location Problems
نویسندگان
چکیده
Submodular facility location functions are widely used for summarizing large datasets and have found applications ranging from sensor placement, image retrieval, and clustering. A significant problem is that evaluating such functions typically requires the calculation of pairwise benefits for all items, which is computationally unmanageable for large problems. In this paper we propose a sparsification method that only computes nearest-neighbor benefits and can dramatically accelerate submodular greedy optimization. We show that the optimal solution of the sparsified problem will be at most a factor of a half from optimal, under minimal assumptions.
منابع مشابه
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem
In this work we consider the maximum p-facility location problem with k additional resource constraints. We prove that the simple greedy algorithm has performance guarantee (1 − e−(k+1))/(k + 1). In the case k = 0 our performance guarantee coincides with bound due to Nemhauser, Wolsey and Fisher [4]. keywords: approximation algorithm, facility location, submodular functions.
متن کاملForthcoming in Mathematical Programming MAXIMIZING A CLASS OF SUBMODULAR UTILITY FUNCTIONS
Given a finite ground set N and a value vector a ∈ R , we consider optimization problems involving maximization of a submodular set utility function of the form h(S) = f (∑ i∈S ai ) , S ⊆ N , where f is a strictly concave, increasing, differentiable function. This function appears frequently in combinatorial optimization problems when modeling risk aversion and decreasing marginal preferences, ...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملSubmodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the context of both feature selection and sparse approximation. We analyze the performance of widely used greedy heuristics, using insights from the maximization of submodular functions and spectral analys...
متن کاملLocating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
Discretionary service facilities are providers of products and/or services that are purchased by customers who are traveling on otherwise preplanned trips such as the daily commute. Optimum location of such facilities requires them to be at or near points in the transportation etwork having sizable flows of different potential customers. N. Fouska (1988) and 0. Berman, R. Larson and N. Fouska (...
متن کامل